Dyadic Polygons
نویسندگان
چکیده
Dyadic rationals are rationals whose denominator is a power of 2. Dyadic triangles and dyadic polygons are respectively de ned as the intersections with the dyadic plane of a triangle or polygon in the real plane whose vertices lie in the dyadic plane. The one-dimensional analogues are dyadic intervals. Algebraically, dyadic polygons carry the structure of a commutative, entropic and idempotent algebra under the binary operation of arithmetic mean. In this talk, dyadic intervals and triangles will be classi ed to within a ne or algebraic isomorphism, and dyadic polygons will be shown to be nitely generated as algebras.
منابع مشابه
Analytic Regularity for Linear Elliptic Systems in Polygons and Polyhedra
We prove weighted anisotropic analytic estimates for solutions of second order elliptic boundary value problems in polyhedra. The weighted analytic classes which we use are the same as those introduced by Guo in 1993 in view of establishing exponential convergence for hp finite element methods in polyhedra. We first give a simple proof of the known weighted analytic regularity in a polygon, rel...
متن کاملProblems around Corona
In this paper the ill-posedness of Shannons sampling theorem is discussed and a regularized sampling algorithm for band-limited signals is presented. The convergence of the regularized sampling algorithm is studied and compared with Shannons sampling theorem by some examples. Diestel, Geoff, University of South Carolina Title: Maximal Bilinear Singular Integral Operators Associated with Planar ...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملInvestigating the mediating role of Dyadic Coping and Understanding and Intellectual Coordination in the relationship between Marital Attractions and Marital Quality
The aim of this research was to investigate the mediating role of dyadic coping and understanding and intellectual coordination in the relationship between marital attractions and marital quality. The research method is correlational modeling of structural equations. The statistical population included all married women active counselors in counseling centers of Isfahan in 1400 207 people were ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 21 شماره
صفحات -
تاریخ انتشار 2011